Online Scheduling and Placement of Real-time Tasks to Partially Reconfigurable Devices

نویسندگان

  • Christoph Steiger
  • Herbert Walder
  • Marco Platzner
  • Lothar Thiele
چکیده

This paper deals with online scheduling of tasks to partially reconfigurable devices. Such devices are able to execute several tasks in parallel. All tasks share the reconfigurable surface as a single resource which leads to highly dynamic allocation situations. To manage such devices at runtime, we propose a reconfigurable operating system that splits into three main modules: scheduler, placer, and loader. The main characteristics of the resulting online scheduling problem is the strong nexus between scheduling and placement. We discuss a fast online placement technique and then focus on scheduling real-time tasks. We devise guarantee-based schedulers for two scenarios, namely tasks with arbitrary and synchronous arrival times. The schedulers exploit the knowledge about task properties to improve the system’s performance. The experiments show that the developed schedulers lead to substantial performance gains at an acceptable runtime overhead.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristics for Onine Scheduling Real-Time Tasks to Partially Reconfigurable Devices

Partially reconfigurable devices allow to configure and execute tasks in a true multitasking manner. The main characteristics of mapping tasks to such devices is the strong nexus between scheduling and placement. In this paper, we formulate a new online real-time scheduling problem and present two heuristics, the horizon and the stuffing technique, to tackle it. Simulation experiments evaluate ...

متن کامل

3D Compaction: A Novel Blocking-Aware Algorithm for Online Hardware Task Scheduling and Placement on 2D Partially Reconfigurable Devices

Few of the benefits of exploiting partially reconfigurable devices are power consumption reduction, cost reduction, and customized performance improvement. To obtain these benefits, one main problem needs to be solved is the task scheduling and placement. Existing algorithms tend to allocate tasks at positions where can block future tasks to be scheduled earlier denoted as ”blocking-effect”. To...

متن کامل

Survey of Online Hardware Task Scheduling and Placement Algorithms for Partially Reconfigurable Computing Systems

Run time Partially Reconfigurable FPGAs find various applications in the field of Cryptography, Image processing, Network Security, Video streaming etc., because of low power consumption, high density, flexibility and high performance. Further more, the dynamism and true multitasking makes it popular in the area of today’s advanced computing platforms. An powerful operating system is required t...

متن کامل

Efficient Runtime Management of Reconfigurable Hardware Resources

R untime reconfigurable systems built upon devices with partial reconfiguration can provide reduction in overall hardware area, power efficiency, and economic cost in addition to the performance improvements due to better customization. However, the users of such systems have to be able to afford some additional costs compared to hardwired application specific circuits. More precisely reconfigu...

متن کامل

Future-based On-line Integrated HW/SW Partitioning and Co-scheduling for Reconfigurable Computing Systems

Reconfigurable computing systems allow executing tasks in a true multitasking manner. Such systems share the reconfigurable device and processing unit as computing resources which leads to highly dynamic allocation situations. To manage such systems at runtime, a reconfigurable operating system is needed. The main part of this operating system is resource management unit which performs HW/SW pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003